Efficient Majority Voting in Digital Hardware

نویسندگان

چکیده

In recent years, machine learning methods became increasingly important for a manifold number of applications. However, they often suffer from high computational requirements impairing their efficient use in real-time systems, even when employing dedicated hardware accelerators. Ensemble are especially suitable acceleration since can be constructed individual learners low complexity and thus offer large parallelization potential. For classification, the outputs these typically combined by majority voting, which represents bottleneck accelerator ensemble inference. this brief, we present novel architecture that allows obtaining decision clock cycles is logarithmic inputs. We show, example application handwritten digit recognition random forest processing engine implemented on an FPGA classification more than seven million images per second, resulting speed-up factor 29 compared to fastest state-of-the-art implementation considered.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Voting on Majority Rules∗

We analyze an overlapping generations model of voting on “reform projects”. These resemble investments in that they first require some investment expenditure and later pay off. Since the time during which old people get the benefit is shorter, or because older people are more wealthy and hence pay more taxes, they are more conservative (against reforms) than young people. We show that if people...

متن کامل

Iterated Majority Voting

We study a model in which a group of agents make a sequence of collective decisions on whether to remain in the current state of the system or switch to an alternative state, as proposed by one of them. Examples for instantiations of this model include the step-wise refinement of a bill of law by means of amendments to be voted on, as well as resource allocation problems, where agents successiv...

متن کامل

Majority voting on restricted domains

In judgment aggregation, unlike preference aggregation, not much is known about domain restrictions that guarantee consistent majority outcomes. We introduce several conditions on individual judgments su¢ cient for consistent majority judgments. Some are based on global orders of propositions or individuals, others on local orders, still others not on orders at all. Some generalize classic soci...

متن کامل

Implementation of Majority Voting Rules∗

I study implementation by agenda, a straightforward voting mechanism that is widely used in practice. The main result resolves an open question which dates back to Black [1958] and Farquharson [1957/1969]. It establishes that any neutral majority voting rule which satisfies the two necessary conditions identified in prior work (McKelvey and Niemi [1978]; Moulin [1986]) as well as a significantl...

متن کامل

Majority voting leads to unanimity

We consider a situation where society decides, through majority voting in a secret ballot, between the alternatives of ‘reform’ and ‘status quo’. Reform is assumed to create a minority of winners, while being efficient in the Kaldor–Hicks sense.We explore the consequences of allowing binding transfers between voters conditional on the chosen alternative. In particular, we establish conditions u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Circuits and Systems Ii-express Briefs

سال: 2022

ISSN: ['1549-7747', '1558-3791']

DOI: https://doi.org/10.1109/tcsii.2022.3144047